Discrete Time Stochastic Networks
نویسنده
چکیده
In this section we study the relation between throughput and queue-length distributions in discrete-time closed cyclic networks when the number of customers and the number of nodes grows unboundedly. To state our findings more precisely: For each positive integer N , consider a cyclic network with n(N) nodes and k(N) customers. We suppose that there are only finitely many types of nodes. That is, at each node the service rate is one of only a finite number L (independent of N) of possible service rates. Assume that n(N) →∞ as N →∞ and also that the limiting customer density α := limN→∞ k(N) · n(N)−1 exists. We further assume that the limiting proportion of nodes of each of the L types exists as N → ∞. We show that the asymptotic throughput exists and can be computed as a function of the limiting customer density and the limiting proportion of nodes of each type. Also, we calculate the asymptotic queue length distribution as a function of the asymptotic throughput. It turns out that the asymptotic behavior of the system depends strongly on the limiting customer density as clearly would be expected. It is a consequence of our results that the following different cases may occur: (1) In case of low traffic, i.e., α = 0, the density of customers in the system eventually is so sparse that the asymptotic throughput is zero. Note that this occurs even though the population size k(N) can grow without bound. (2) In case of heavy traffic, with α = ∞, it is natural to expect bottlenecks to occur at those servers which have the slowest limiting service rates (as the queue length approaches infinity). Indeed we shall conclude that asymptotically-infinite mean queue lengths occur at precisely such servers. (3) It is more interesting that even if the limiting customer density is finite, there may be servers with asymptotically-infinite mean queue length. However, such behavior will occur only when the customer density is sufficiently large and only for those servers with the slowest limiting service rates.
منابع مشابه
Arrival probability in the stochastic networks with an established discrete time Markov chain
The probable lack of some arcs and nodes in the stochastic networks is considered in this paper, and its effect is shown as the arrival probability from a given source node to a given sink node. A discrete time Markov chain with an absorbing state is established in a directed acyclic network. Then, the probability of transition from the initial state to the absorbing state is computed. It is as...
متن کاملCombination of Approximation and Simulation Approaches for Distribution Functions in Stochastic Networks
This paper deals with the fundamental problem of estimating the distribution function (df) of the duration of the longest path in the stochastic activity network such as PERT network. First a technique is introduced to reduce variance in Conditional Monte Carlo Sampling (CMCS). Second, based on this technique a new procedure is developed for CMCS. Third, a combined approach of simulation and ap...
متن کاملDeveloping a 3D stochastic discrete fracture network model for hydraulic analyses
Fluid flow in jointed rock mass with impermeable matrix is often controlled by joint properties, including aperture, orientation, spacing, persistence and etc. On the other hand, since the rock mass is made of heterogeneous and anisotropic natural materials, geometric properties of joints may have dispersed values. One of the most powerful methods for simulation of stochastic nature of geometri...
متن کاملFINITE-TIME PASSIVITY OF DISCRETE-TIME T-S FUZZY NEURAL NETWORKS WITH TIME-VARYING DELAYS
This paper focuses on the problem of finite-time boundedness and finite-time passivity of discrete-time T-S fuzzy neural networks with time-varying delays. A suitable Lyapunov--Krasovskii functional(LKF) is established to derive sufficient condition for finite-time passivity of discrete-time T-S fuzzy neural networks. The dynamical system is transformed into a T-S fuzzy model with uncertain par...
متن کاملWavelet Based Estimation of the Derivatives of a Density for a Discrete-Time Stochastic Process: Lp-Losses
We propose a method of estimation of the derivatives of probability density based on wavelets methods for a sequence of random variables with a common one-dimensional probability density function and obtain an upper bound on Lp-losses for such estimators. We suppose that the process is strongly mixing and we show that the rate of convergence essentially depends on the behavior of a special quad...
متن کاملRobust stability of stochastic fuzzy impulsive recurrent neural networks with\ time-varying delays
In this paper, global robust stability of stochastic impulsive recurrent neural networks with time-varyingdelays which are represented by the Takagi-Sugeno (T-S) fuzzy models is considered. A novel Linear Matrix Inequality (LMI)-based stability criterion is obtained by using Lyapunov functional theory to guarantee the asymptotic stability of uncertain fuzzy stochastic impulsive recurrent neural...
متن کامل